Cut and Paste

نویسندگان

  • Giansalvatore Mecca
  • Paolo Atzeni
چکیده

The paper develops Editor, a language for manipulating semi-structured documents, such as the ones typically available on the Web. Editor programs are based on two simple ideas, taken from text editors: \search" instructions are used to select regions of interest in a document, and \cut & paste" to restructure them. We study the expressive power and the complexity of these programs. We show that they are computationally complete, in the sense that any computable document restructuring can be expressed in Editor. We also study the complexity of a safe subclass of programs, showing that it captures exactly the class of polynomial-time restruc-turings. The language has been implemented in Java, and is currently used in the Araneus project as a basis for a wrapper{generation toolkit.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cut and Paste Based Text Summarization

s /åJ“Ér [1], [2], [3]7Hë H̀¦&ñ o #Œ 6£§?/6 x̀¦ ê r . identification of cutting and pasting operation decomposition of human-written summary sentences development of an automatic system to perform cut and paste operation(sentence reduction, sentence combination, ...)

متن کامل

Synthesis of DNA block copolymers with extended nucleic acid segments by enzymatic ligation: cut and paste large hybrid architecturesw

COMMUNICATION Andreas Herrmann et al. Synthesis of DNA block copolymers with extended nucleic acid segments by enzymatic ligation: cut and paste large hybrid architectures

متن کامل

Short proofs for cut-and-paste sorting of permutations

We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pasted into the remaining string, possibly reversed. We give short proofs that every permutation of [n] can be transformed to the identity in at most ⌊2n/3⌋ such moves and that some permutations require at least ⌊n/2⌋ moves.

متن کامل

Se p 20 12 CONVERGENCE RATES OF MARKOV CHAINS ON SPACES OF PARTITIONS

We study the convergence rate to stationarity for a class of exchangeable partitionvalued Markov chains called cut-and-paste chains. The law governing the transitions of a cut-and-paste chain are determined by products of i.i.d. stochastic matrices, which describe the chain induced on the simplex by taking asymptotic frequencies. Using this representation, we establish upper bounds for the mixi...

متن کامل

Cut-and-Paste Editing Based on Constrained B-spline Volume Fitting

This paper proposes an advanced cut-and-paste editing for three-dimensional models. We introduce a new parameterization technique based on constrained B-spline surface/volume fitting. Our cut-and-paste editing is performed on this parameterization. In our method, a parametric volume is generated so that its isoparametric surface fits to the base surface and the volume bounds the detail. Our vol...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 58  شماره 

صفحات  -

تاریخ انتشار 1999